Laboratory Automation in a Functional Programming Language
نویسندگان
چکیده
منابع مشابه
Laboratory automation in a functional programming language.
After some years of use in academic and research settings, functional languages are starting to enter the mainstream as an alternative to more conventional programming languages. This article explores one way to use Haskell, a functional programming language, in the development of control programs for laboratory automation systems. We give code for an example system, discuss some programming co...
متن کاملDesigning a Programming Language for Home Automation
The AutoHAN project at the Cambridge Computer Laboratory is developing a range of technologies related to next-generation home networking and automation. Several aspects of the project involve the development of programming languages suitable for use in the home. Languages of this sort will clearly have a significant impact on the usability of domestic electronic devices, and greatly broaden th...
متن کاملA Structured Functional Programming Language
Declarative languages provide means of specifying problem solutions, without giving much attention to how the proposed solution is going to be effectively implemented. When only specification is provided, the system attempts execution using search techniques which may compromise efficiency. In this paper, we propose a new programming language that integrates functional and logic features togeth...
متن کاملA functional quantum programming language
This thesis introduces the language QML, a functional language for quantumcomputations on finite types. QML exhibits quantum data and control structures,and integrates reversible and irreversible quantum computations.The design of QML is guided by the categorical semantics: QML programs are in-terpreted by morphisms in the category FQC of finite quantum computations, whichpr...
متن کاملAutomation for Dependently Typed Functional Programming
Writing dependently typed functional programs that capture non-trivial program properties, such as those involving membership, ordering and non-linear arithmetic, is difficult in current system due to lack of proof automation. We identify and discuss proof patterns that occur when programming with dependent types and detail how the automation of such patterns allow us to work more comfortably w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Laboratory Automation
سال: 2014
ISSN: 2211-0682,1540-2452
DOI: 10.1177/2211068214543373